On the Ordered List Subgraph Embedding Problems
نویسندگان
چکیده
منابع مشابه
On The Book Embedding Of Ordered Sets
In the book embedding of an ordered set, the elements of the set are embedded along the spine of a book to form a linear extension. The pagenumber (or stack number) is the minimum number of pages needed to draw the edges as simple curves such that edges drawn on the same page do not intersect. The pagenumber problem for ordered sets is known to be NP-complete, even if the order of the elements ...
متن کاملOrdered Vertex Removal and Subgraph Problems Vertex Removal and Graph Problems
Several new graph theoretic problems, which arise naturally from existing coloring algorithms, are de ned. The complementary High Degree Vertex Removal Problem and Low Degree Vertex Removal Problem are both shown to be NP-complete. The Low Degree Subgraph Problem is de ned and shown to be NP-complete, whereas, the \complementary" problem for high degree subgraphs was previously shown to be P-co...
متن کاملOn the Computational Complexity of Ordered Subgraph Recognition
Let (G, <) be a finite graph G with a linearly ordered vertex set V. We consider the decision problem (G, <)ORD to have as an instance an (unordered) graph r and as a question whether there exists a linear order < on V(T) and an order preserving graph isomorphism of (G, <) onto an induced subgraph of r. Several familiar classes of graph are characterized as the yes-instances of (G, <)ORD for ap...
متن کاملVirtual Network Embedding Algorithms Based on Best-Fit Subgraph Detection
One of the main objectives of cloud computing providers is increasing the revenue of their cloud datacenters by accommodating virtual network requests as many as possible. However, arrival and departure of virtual network requests fragment physical network’s resources and reduce the possibility of accepting more virtual network requests. To increase the number of virtual network requests accomm...
متن کاملk-edge Subgraph Problems
We study here a problem on graphs that involves finding a subgraph of maximum node weights spanning up to k edges. We interpret the concept of “spanning” to mean that at least one endpoint of the edge is in the subgraph in which we seek to maximize the total weight of the nodes. We discuss the complexity of this problem and other related problems with different concepts of “spanning” and show t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2015
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-015-9980-2